Search results for "discrete [space-time]"

showing 10 items of 2035 documents

Forbidden words in symbolic dynamics

2000

AbstractWe introduce an equivalence relation≃between functions from N to N. By describing a symbolic dynamical system in terms of forbidden words, we prove that the≃-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sofic systems, we prove that the≃-equivalence of the corresponding functions is a decidable question. As a more special application, we show, by using the new invariant, that two systems associated to Sturmian words having “different slope” are not conjugate.

Discrete mathematicsApplied Mathematicsautomata and formal languages010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamics[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesFunction (mathematics)16. Peace & justice01 natural sciencesDecidabilitysymbolic dynamics010201 computation theory & mathematicsEquivalence relationcombinatoric on words0101 mathematicsInvariant (mathematics)Dynamical system (definition)Equivalence (measure theory)Computer Science::Formal Languages and Automata TheoryWord (group theory)ComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Regular Minimality and Thurstonian-type modeling

2009

Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…

Discrete mathematicsApplied Mathematicsmedia_common.quotation_subjectHausdorff spaceMultivariate normal distributionDecision ruleMaxima and minimaSymmetric relationPerceptionEuclidean geometryPairwise comparisonGeneral Psychologymedia_commonMathematicsJournal of Mathematical Psychology
researchProduct

Domains of accretive operators in Banach spaces

2016

LetD(A)be the domain of anm-accretive operatorAon a Banach spaceE. We provide sufficient conditions for the closure ofD(A)to be convex and forD(A)to coincide withEitself. Several related results and pertinent examples are also included.

Discrete mathematicsApproximation propertyGeneral Mathematics010102 general mathematicsBanach spaceClosure (topology)Finite-rank operatorResolvent formalism01 natural sciencesDomain (mathematical analysis)010101 applied mathematicsOperator (computer programming)0101 mathematicsC0-semigroupMathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
researchProduct

Exact, efficient, and complete arrangement computation for cubic curves

2006

AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…

Discrete mathematicsArrangementsControl and OptimizationComputationAlgebraic curvesMathematical analysisBézier curveSweep line algorithmComputer Science ApplicationsModuli of algebraic curvesComputational MathematicsGeometric designComputational Theory and MathematicsFamily of curvesSweep-line algorithmExact geometric computationGeometric primitiveAlgebraic curveGeometry and TopologyRobustnessComputingMethodologies_COMPUTERGRAPHICSMathematicsComputational Geometry
researchProduct

A note on best approximation in 0-complete partial metric spaces

2014

We study the existence and uniqueness of best proximity points in the setting of 0-complete partial metric spaces. We get our results by showing that the generalizations, which we have to consider, are obtained from the corresponding results in metric spaces. We introduce some new concepts and consider significant theorems to support this fact.

Discrete mathematicsArticle SubjectApplied MathematicsInjective metric spacelcsh:MathematicsT-normlcsh:QA1-939Intrinsic metricConvex metric spaceUniform continuityMetric spaceFréchet spaceSettore MAT/05 - Analisi Matematica0-completeness best proximity point fixed point partial metric spaceMetric (mathematics)AnalysisMathematics
researchProduct

Common Fixed Points in a Partially Ordered Partial Metric Space

2013

In the first part of this paper, we prove some generalized versions of the result of Matthews in (Matthews, 1994) using different types of conditions in partially ordered partial metric spaces for dominated self-mappings or in partial metric spaces for self-mappings. In the second part, using our results, we deduce a characterization of partial metric 0-completeness in terms of fixed point theory. This result extends the Subrahmanyam characterization of metric completeness.

Discrete mathematicsArticle SubjectInjective metric spacelcsh:MathematicsEquivalence of metricslcsh:QA1-939Fixed points dominated self-mappings 0-completenessConvex metric spaceIntrinsic metricCombinatoricsMetric spaceSettore MAT/05 - Analisi MatematicaMetric (mathematics)Metric differentialFisher information metricMathematicsInternational Journal of Analysis
researchProduct

Characterizations of Orlicz-Sobolev Spaces by Means of Generalized Orlicz-Poincaré Inequalities

2012

Let Φ be anN-function. We show that a functionu∈LΦ(ℝn)belongs to the Orlicz-Sobolev spaceW1,Φ(ℝn)if and only if it satisfies the (generalized) Φ-Poincaré inequality. Under more restrictive assumptions on Φ, an analog of the result holds in a general metric measure space setting.

Discrete mathematicsArticle Subjectlcsh:MathematicsFunction (mathematics)Space (mathematics)lcsh:QA1-939Measure (mathematics)Sobolev spacesymbols.namesakePoincaré conjectureMetric (mathematics)symbolsAnalysisMathematicsJournal of Function Spaces and Applications
researchProduct

On a theorem of Khan in a generalized metric space

2013

Existence and uniqueness of fixed points are established for a mapping satisfying a contractive condition involving a rational expression on a generalized metric space. Several particular cases and applications as well as some illustrative examples are given.

Discrete mathematicsArticle Subjectlcsh:MathematicsInjective metric spacerational expression.Pseudometric spaceFixed pointFixed pointlcsh:QA1-939Convex metric spaceMetric spaceSettore MAT/05 - Analisi MatematicaMetric (mathematics)Uniquenessgeneralized metric spaceMetric differentialMathematics
researchProduct

Uncertainty measures—Problems concerning additivity

2009

Additivity of an uncertainty measure on an MV-algebra has a clear meaning. If the divisibility is dropped, we come up to a so-called Girard algebra. There we discuss strong resp. weak additivity based on so-called divisible disjoint unions resp. on additivity for all sub-MV-algebras. We obtain a description of those extensions from additive measures on an MV-algebra to the canonical Girard algebra extension of pairs which are strongly additive and valuation measures. Finally, we prove the non-existence of strongly additive measure extensions, if the underlying MV-algebra is a finite chain with more than two non-trivial elements.

Discrete mathematicsArtificial IntelligenceLogicAdditive functionMV-algebraExtension (predicate logic)Divisibility ruleDisjoint setsSigma additivityMeasure (mathematics)Valuation (algebra)MathematicsFuzzy Sets and Systems
researchProduct

Measure-free conditioning and extensions of additive measures on finite MV-algebras

2010

Using the well known representation of any finite MV-algebra as a product of finite MV-chains as factors, we obtain a representation of its canonical extension as a Girard algebra product of the canonical extensions of the MV-chain factors. Based on this representation and using the results from our last paper, we characterize the additive measures on any finite MV-algebra resp. the weakly and the strongly additive measures on its canonical Girard algebra extension, and that as convex combinations of the corresponding measures on the respective factors. After that we apply the results to measure-free defined conditional events which for this reason are considered as elements of the canonica…

Discrete mathematicsArtificial IntelligenceLogicLattice (order)Additive functionFuzzy setRegular polygonInformation processingConditional probabilityProbability distributionFuzzy control systemMathematicsFuzzy Sets and Systems
researchProduct